Direct Unconstrained Variable-Metric Localization of One-Electron Orbitals
نویسندگان
چکیده
منابع مشابه
Limited-memory projective variable metric methods for unconstrained minimization
A new family of limited-memory variable metric or quasi-Newton methods for unconstrained minimization is given. The methods are based on a positive definite inverse Hessian approximation in the form of the sum of identity matrix and two low rank matrices, obtained by the standard scaled Broyden class update. To reduce the rank of matrices, various projections are used. Numerical experience is e...
متن کاملComputational experience with improved variable metric methods for unconstrained minimization
Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library The paper describes ...
متن کاملOn the Rate of Convergence of Variable Metric Algorithms for Unconstrained Optimization
A procedure is described tha t is suitable for investigating rates of convergence of variable metric algorithms numerically. The usual rate seems to be the one tha t is given by Ritter [6], but, except when there are only two variables, we are unable to prove that Bitter's rate is achieved under mild conditions on the objective function. An example is given to show that , even though the object...
متن کاملRandom Perturbation of the Variable Metric Method for Unconstrained Nonsmooth Nonconvex Optimization
We consider the global optimization of a nonsmooth (nondifferentiable) nonconvex real function. We introduce a variable metric descent method adapted to nonsmooth situations, which is modified by the incorporation of suitable random perturbations. Convergence to a global minimum is established and a simple method for the generation of suitable perturbations is introduced. An algorithm is propos...
متن کاملA Combined Variable Metric - Conjugate Gradient Algorithm for a Class of Large Scale Unconstrained Minimization Problems
An algorithm is being presented for a special class of unconstrained minimization problems. The algorithm exploits the special structure of the Hessian in the problems under consideration, It is based on applying Bertsekas' I-1] Scaled Partial Conjugate Gradient method with respect to a metric that is updated by the Rank One update, using gradients obtained in the preceeding steps. Two classes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Theory and Computation
سال: 2020
ISSN: 1549-9618,1549-9626
DOI: 10.1021/acs.jctc.9b01286